Flexible Distributed Matrix Multiplication
نویسندگان
چکیده
The distributed matrix multiplication problem with an unknown number of stragglers is considered, where the goal to efficiently and flexibly obtain product two massive matrices by distributing computation across $N$ servers. There are up notation="LaTeX">$N - R$ but exact not known a priori. Motivated reducing load each server, flexible solution proposed fully utilize capability available computing task for server separated into several subtasks, constructed based on Entangled Polynomial codes Yu et al. final results can be obtained from either larger servers smaller amount completed per or server. required finite field size less than notation="LaTeX">$2N$ . Moreover, optimal design parameters such as partitioning input discussed. Our constructions also generalized other settings batch secure multiplication.
منابع مشابه
A Flexible Class of Parallel Matrix Multiplication Algorithms
This paper explains why parallel implementation of matrix multiplication—a seemingly simple algorithm that can be expressed as one statement and three nested loops—is complex: Practical algorithms that use matrix multiplication tend to use matrices of disparate shapes, and the shape of the matrices can significantly impact the performance of matrix multiplication. We provide a class of algorith...
متن کاملSparse matrix multiplication: The distributed block-compressed sparse row library
Efficient parallel multiplication of sparse matrices is key to enabling many large-scale calculations. This article presents the DBCSR (Distributed Block Compressed Sparse Row) library for scalable sparse matrix-matrix multiplication and its use in the CP2K program for linear-scaling quantum-chemical calculations. The library combines several approaches to implement sparse matrix multiplication...
متن کاملHP-DAEMON: High Performance Distributed Adaptive Energy-efficient Matrix-multiplicatiON
The demands of improving energy efficiency for high performance scientific applications arise crucially nowadays. Software-controlled hardware solutions directed by Dynamic Voltage and Frequency Scaling (DVFS) have shown their effectiveness extensively. Although DVFS is beneficial to green computing, introducing DVFS itself can incur non-negligible overhead, if there exist a large number of fre...
متن کاملCommunication lower bounds for distributed-memory matrix multiplication
We present lower bounds on the amount of communication that matrixmultiplication algorithms must perform on a distributed-memory parallel computer. We denote the number of processors by P and the dimension of square matrices by n. We show that the most widely-used class of algorithms, the so-called 2-dimensional (2D) algorithms, are optimal, in the sense that in any algorithm that uses only O(n...
متن کاملAn Experimental Investigation of Distributed Matrix Multiplication Techniques
This paper discusses the development and refinement of several distributed matrix multiplication algorithms. Our goal in this research has been to determine if successful distribution of this problem is possible within a loosely-coupled environment. Our criteria for success are fast execution speed and, to a lesser extent, memory efficiency. Our results indicate that, perhaps counter-intuitivel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3204488